$M$-periodic problem of order $2k$

M -periodic Problem of Order 2k

Avoiding (m, m, m)-Arrays of Order n=2k

An (m,m,m)-array of order n is an n×n array such that each cell is assigned a set of at most m symbols from {1, . . . , n} such that no symbol occurs more than m times in any row or column. An (m,m,m)-array is called avoidable if there exists a Latin square such that no cell in the Latin square contains a symbol that also belongs to the set assigned to the corresponding cell in the array. We sh...

Periodic solutions of fourth-order delay differential equation

In this paper the periodic solutions of fourth order delay differential equation of the form $ddddot{x}(t)+adddot{x}(t)+f(ddot{x}(t-tau(t)))+g(dot{x}(t-tau(t)))+h({x}(t-tau(t)))=p(t)$  is investigated. Some new positive periodic criteria are given.  

the problem of divine hiddenness

این رساله به مساله احتجاب الهی و مشکلات برهان مبتنی بر این مساله میپردازد. مساله احتجاب الهی مساله ای به قدمت ادیان است که به طور خاصی در مورد ادیان ابراهیمی اهمیت پیدا میکند. در ادیان ابراهیمی با توجه به تعالی خداوند و در عین حال خالقیت و حضور او و سخن گفتن و ارتباط شهودی او با بعضی از انسانهای ساکن زمین مساله ای پدید میاید با پرسشهایی از قبیل اینکه چرا ارتباط مستقیم ویا حداقل ارتباط وافی به ب...

A Combinatorial Proof of a Relationship Between Maximal $(2k-1, 2k+1)$-Cores and $(2k-1, 2k, 2k+1)$-Cores

Integer partitions which are simultaneously t–cores for distinct values of t have attracted significant interest in recent years. When s and t are relatively prime, Olsson and Stanton have determined the size of the maximal (s, t)-core κs,t. When k > 2, a conjecture of Amdeberhan on the maximal (2k − 1, 2k, 2k + 1)-core κ2k−1,2k,2k+1 has also recently been verified by numerous authors. In this ...